Optional Polya Tree and Bayesian Inference
نویسندگان
چکیده
We introduce an extension of the Pólya tree approach for constructing distributions on the space of probability measures. By using optional stopping and optional choice of splitting variables, the construction gives rise to random measures that are absolutely continuous with piecewise smooth densities on partitions that can adapt to fit the data. The resulting “optional Pólya tree” distribution has large support in total variation topology and yields posterior distributions that are also optional Pólya trees with computable parameter values.
منابع مشابه
Nonparametric Bayesian Data Analysis
We review the current state of nonparametric Bayesian inference. The discussion follows a list of important statistical inference problems, including density estimation, regression, survival analysis, hierarchical models and model validation. For each inference problem we review relevant nonparametric Bayesian models and approaches including Dirichlet process (DP) models and variations, Polya t...
متن کاملConsistent semiparametric Bayesian inference about a location parameter
We consider the problem of Bayesian inference about the centre of symmetry of a symmetric density on the real line based on independent identically distributed observations. A result of Diaconis and Freedman shows that the posterior distribution of the location parameter may be inconsistent if (symmetrized) Dirichlet process prior is used for the unknown distribution function. We choose a symme...
متن کاملConsistent semiparametric
We consider the problem of Bayesian inference about the centre of symmetry of a symmetric density on the real line based on independent identically distributed observations. A result of Diaconis and Freedman shows that the posterior distribution of the location parameter may be inconsistent if (symmetrized) Dirichlet process prior is used for the unknown distribution function. We choose a symme...
متن کاملA fast algorithm for finding junction trees 81 A sufficientlyfast algorithm for finding close to optimal junction trees
Au algorithm is developed for findiug a close to optimal junction tree of a given graph Tile algorithm has a worst case co~nplexity O(ckn~) where a and c are coustants, the nmnber of vertices, and k is largest clique in a juuction tree of G in which this size is mini~nized. The algorithm guarantees that the logarittHn of the size of the state space of the heaviest clique in the junction tree pr...
متن کاملA New Acceptance Sampling Design Using Bayesian Modeling and Backwards Induction
In acceptance sampling plans, the decisions on either accepting or rejecting a specific batch is still a challenging problem. In order to provide a desired level of protection for customers as well as manufacturers, in this paper, a new acceptance sampling design is proposed to accept or reject a batch based on Bayesian modeling to update the distribution function of the percentage of nonconfor...
متن کامل